a(c(x1)) → c(b(x1))
a(x1) → b(b(b(x1)))
b(c(b(x1))) → a(c(x1))
↳ QTRS
↳ DependencyPairsProof
a(c(x1)) → c(b(x1))
a(x1) → b(b(b(x1)))
b(c(b(x1))) → a(c(x1))
A(x1) → B(b(x1))
A(x1) → B(b(b(x1)))
A(c(x1)) → B(x1)
A(x1) → B(x1)
B(c(b(x1))) → A(c(x1))
a(c(x1)) → c(b(x1))
a(x1) → b(b(b(x1)))
b(c(b(x1))) → a(c(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
A(x1) → B(b(x1))
A(x1) → B(b(b(x1)))
A(c(x1)) → B(x1)
A(x1) → B(x1)
B(c(b(x1))) → A(c(x1))
a(c(x1)) → c(b(x1))
a(x1) → b(b(b(x1)))
b(c(b(x1))) → a(c(x1))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(x1) → B(b(x1))
A(x1) → B(b(b(x1)))
A(c(x1)) → B(x1)
A(x1) → B(x1)
Used ordering: Polynomial interpretation [25,35]:
B(c(b(x1))) → A(c(x1))
The value of delta used in the strict ordering is 1/8.
POL(c(x1)) = (4)x_1
POL(B(x1)) = (1/4)x_1
POL(a(x1)) = 1 + x_1
POL(A(x1)) = 1/4 + (1/4)x_1
POL(b(x1)) = 1/4 + x_1
a(c(x1)) → c(b(x1))
a(x1) → b(b(b(x1)))
b(c(b(x1))) → a(c(x1))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
B(c(b(x1))) → A(c(x1))
a(c(x1)) → c(b(x1))
a(x1) → b(b(b(x1)))
b(c(b(x1))) → a(c(x1))